A graph structure over the category of sets and partial functions

نویسنده

  • Yoshihiro Mizoguchi
چکیده

In 1984, Raoult proposed a formalization of graph rewritings using pushouts in the category of graphs and partial functions. This note generalizes his method and formulates algebraic graph structure to introduce a more general framework for graph rewritings and to give a simple proof of existence theorem of pushouts using relational calculus.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Independent Sets for the Pixel Expansion of Graph Access Structure

 Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...

متن کامل

MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE

Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...

متن کامل

A RELATION BETWEEN THE CATEGORIES Set * , SetT, Set AND SetT

In this article, we have shown, for the add-point monad T, thepartial morphism category Set*is isomorphic to the Kleisli category SetT. Alsowe have proved that the category, SetT, of T-algebras is isomorphic to thecategory Set of pointed sets. Finally we have established commutative squaresinvolving these categories.

متن کامل

Relevant Categories and Partial Functions

A relevant category is a symmetric monoidal closed category with a diagonal natural transformation that satisfies some coherence conditions. Every cartesian closed category is a relevant category in this sense. The denomination relevant comes from the connection with relevant logic. It is shown that the category of sets with partial functions, which is isomorphic to the category of pointed sets...

متن کامل

THE INTERNAL IDEAL LATTICE IN THE TOPOS OF M-SETS

We believe that the study of the notions of universal algebra modelled in an arbitarry topos rather than in the category of sets provides a deeper understanding of the real features of the algebraic notions. [2], [3], [4], [S], [6], [7], [13], [14] are some examples of this approach. The lattice Id(L) of ideals of a lattice L (in the category of sets) is an important ingredient of the categ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993